# include <stdio.h>
int isPrime (int i);
int main () {
int n , m , i , x , count = 0;
printf (" Enter n and m\n with n>0 and m > n : ");
scanf ("%d%d" , &n , &m);
if ( (n > 0 && m > 0 ) && m > n ) {
for (i = n ; i <= m ; i++) {
x = isPrime (i);
if (x==1){
	printf ("%d " , i);
	count++;
		}
}
		if (count == 0)
		printf ("\n No prime numbers found in [%d , %d] interval" , n , m);
		else
		printf ("\n%d prime numbers found." , count); 
}
else 
printf ("wrong input");
return -1 ;
 }

int isPrime (int i){
	int j;
	for (j = 2; i%j != 0 ; j++);
		if ( i / j == 1)
		return 1;
		else
		return 0; 
}


